List decoding of a class of affine variety codes
نویسندگان
چکیده
Consider a polynomial F in m variables and a finite point ensemble S = S1 × · · · × Sm. When given the leading monomial of F with respect to a lexicographic ordering we derive improved information on the possible number of zeros of F of multiplicity at least r from S. We then use this information to design a list decoding algorithm for a large class of affine variety codes.
منابع مشابه
Weighted Reed-Muller codes revisited
We consider weighted Reed-Muller codes over point ensemble S1 × · · · × Sm where Si needs not be of the same size as Sj . For m = 2 we determine optimal weights and analyze in detail what is the impact of the ratio |S1|/|S2| on the minimum distance. In conclusion the weighted Reed-Muller code construction is much better than its reputation. For a class of affine variety codes that contains the ...
متن کاملFast Erasure-and-Error Decoding and Systematic Encoding of a Class of Affine Variety Codes
In this paper, a lemma in algebraic coding theory is established, which is frequently appeared in the encoding and decoding for algebraic codes such as Reed–Solomon codes and algebraic geometry codes. This lemma states that two vector spaces, one corresponds to information symbols and the other is indexed by the support of Gröbner basis, are canonically isomorphic, and moreover, the isomorphism...
متن کاملImproved decoding of affine–variety codes
We provide a decoding technique for affine-variety codes using a multidimensional extension of general error locator polynomials. We prove the existence of such polynomials for any affine-variety code and hence for any linear code. We compute some interesting cases, including Hermitian codes.
متن کاملAspects of List-of-Two Decoding
We study the problem of list decoding with focus on the case when we have a list size limited to two. Under this restriction we derive general lower bounds on the maximum possible size of a list-of-2-decodable code. We study the set of correctable error patterns in an attempt to obtain a characterization. For a special family of Reed-Solomon codes—which we identify and name class-I codes—we giv...
متن کاملDecoding Affine Variety Codes Using Gröbner Bases
We define a class of codes that we call affine variety codes. These codes are obtained by evaluating functions in the coordinate ring of an affine variety on all the Fq-rational points of the variety. We show that one can, at least in theory, decode these codes up to half the true minimum distance by using the theory of Gröbner bases. We extend results of A. B. Cooper and of X. Chen, I. S. Reed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1101.4999 شماره
صفحات -
تاریخ انتشار 2011